Modular Polynomials in Higher Rank
نویسندگان
چکیده
We study modular polynomials classifying cyclic isogenies between Drinfeld modules of arbitrary rank over the ring Fq[T ].
منابع مشابه
Higher rank numerical ranges of rectangular matrix polynomials
In this paper, the notion of rank-k numerical range of rectangular complex matrix polynomials are introduced. Some algebraic and geometrical properties are investigated. Moreover, for ϵ > 0; the notion of Birkhoff-James approximate orthogonality sets for ϵ-higher rank numerical ranges of rectangular matrix polynomials is also introduced and studied. The proposed denitions yield a natural genera...
متن کاملModular Computation for Matrices of Ore Polynomials
We give a modular algorithm to perform row reduction of a matrix of Ore polynomials with coefficients in Z[t]. Both the transformation matrix and the transformed matrix are computed. The algorithm can be used for finding the rank and left nullspace of such matrices. In the special case of shift polynomials, we obtain algorithms for computing a weak Popov form and for computing a greatest common...
متن کاملSome Results on the Generalized Higher Rank Numerical Ranges
In this paper, the notion of rank−k numerical range of rectangular complex matrix polynomials are introduced. Some algebraic and geometrical properties are investigated. Moreover, for > 0, the notion of Birkhoff-James approximate orthogonality sets for −higher rank numerical ranges of rectangular matrix polynomials is also introduced and studied. The proposed definitions yield a natural general...
متن کاملA Practical Implementation of a Modular Algorithm for Ore Polynomial Matrices
We briefly review a modular algorithm to perform row reduction of a matrix of Ore polynomials with coefficients in Z[t], and describe a practical implementation in Maple that improves over previous modular and fraction-free versions. The algorithm can be used for finding the rank, left nullspace, and the Popov form of such matrices.
متن کاملPartial proof of Graham Higman's conjecture related to coset diagrams
Graham Higman has defined coset diagrams for PSL(2,ℤ). These diagrams are composed of fragments, and the fragments are further composed of two or more circuits. Q. Mushtaq has proved in 1983 that existence of a certain fragment γ of a coset diagram in a coset diagram is a polynomial f in ℤ[z]. Higman has conjectured that, the polynomials related to the fragments are monic and for a fixed degree...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2008